Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation
نویسندگان
چکیده
The search space of constraint satisfaction problems (CSPs) can be reduced by using value interchangeability. This notion consists of aggregating subsets of values that behave similarly on the future branches of the search. BT-CPR [8], is a typical backtracking algorithm using value interchangeability. It uses the Cartesian product representation of the search space (CPR) which aggregates partial solutions and proves particularly useful for finding and representing all solutions of a CSP. It is assessed that maintaining arc-consistency (MAC) is the most efficient general algorithm for solving hard problems. A few work on combining MAC with CPR exists. In this paper we study comparatively two other possible alternatives of MAC-CPR.
منابع مشابه
Optimizing STR Algorithms with Tuple Compression
Table constraints define an arbitrary constraint explicitly as a set of solutions (tuples) or non-solutions. Thus, space is proportional to number of tuples. Simple Tabular Reduction (STR), which dynamically reduces the table size by maintaining a table of only the valid tuples, has been shown to be efficient for enforcing Generalized Arc Consistency. The Cartesian product representation is ano...
متن کاملSolving Non-binary CSPs Using the Hidden Variable Encoding
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-established binary CSP techniques or use extended versions of binary techniques directly on the non-binary problem. Recently, it has been shown that the hidden variable encoding is a promising method of translating non-...
متن کاملProbabilistic Consistency Boosts MAC and SAC
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de facto standard to solve CSPs. Maintaining higher levels of consistency, generally, reduces the search effort. However, due to ineffective constraint propagation, it often penalises the search algorithm in terms of time....
متن کاملThe Difference All-Difference Makes
We perform a comprehensive theoretical and experimental analysis of the use of all-different constraints. We prove that generalized arc-consistency on such constraints lies between neighborhood inverse consistency and, under a simple restriction, path inverse consistency on the binary representation of the problem. By generalizing the arguments of Kondrak and van Beek, we prove that a search al...
متن کاملThe Di erence All - Di erence Makes
We perform a comprehensive theoretical and experimental analysis of the use of all-diierent constraints. We prove that generalized arc-consistency on such constraints lies between neighborhood inverse consistency and, under a simple restriction, path inverse consistency on the binary representation of the problem. By generalizing the arguments of Kondrak and van Beek, we prove that a search alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999